FAULT TOLERANT ALGORITHM TO COPE WITH TOPOLOGY CHANGES DUE TO POSTURAL MOBILITY

نویسندگان

چکیده

The research involving in providing healthcare services to remote patients have led the exploration of new solutions provide effective Quality Service (QoS) and fault tolerant network for Wireless Body Area Network (WBAN). With growing number diseases percentage elderly people, need medicated assisted life disabled or old age population has increased a lot. To deal with these conditions, there must exist Fault Tolerant system. WBAN health care scenario is greatly impacted by issues related efficient data transmission. In this paper, DV-Hop algorithm utilized localization mobile nodes order cope up topology changes due postural mobility.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fault-Tolerant Optimal Broadcast Algorithm for the Hypercube Topology

This paper presents an optimal broadcast algorithm for the hypercube networks. The main focus of the paper is the effectiveness of the algorithm in the presence of many node faults. For the optimal solution, our algorithm builds with spanning tree connecting the all nodes of the networks, through which messages are propagated from source node to remaining nodes. At any given time, maximum n − 1...

متن کامل

Fault Tolerant Topology Control with Unreliable Failure Detectors

Wireless ad-hoc networking has emerged as its own discipline over the past decade and topology control is an important problem in such networks. The aim of topology control is to construct an appropriate topology to improve the efficiency and performance of the overlying algorithms (e.g., routing). Fault tolerance is a necessary feature of a topology to be applicable in realistic scenarios. Thi...

متن کامل

Fault Tolerant Faddeeva Algorithm 1

We present an algorithm based fault tolerant scheme suitable for array implementations of the Faddeeva algorithm. Our technique corrects errors due to multiple transient, intermittent, or permanent faults provided these are restricted to a single column of the array. We show how to nd the location of the faulty column and to determine the correct Schur complement from the erroneous one. The fau...

متن کامل

Fault - Tolerant Sorting Algorithm on

In this paper, algorithmic fault-tolerant techniques are introduced for sorting algorithms on n-dimensional hypercube multicomputers. We propose a fault-tolerant sorting algorithm that can tolerate up n 1 faulty processors. First, we indicate that the bitonic sorting algorithm can perform sorting operations correctly on the hypercubes with one faulty processor. In order to tolerate up r n 1 fau...

متن کامل

Fault Tolerant Consensus Agreement Algorithm

Recently a new fault tolerant and simple mechanism was designed for solving commit consensus problem. It is based on replicated validation of messages sent between transaction participants and a special dispatcher validator manager node. This paper presents a correctness, safety proofs and performance analysis of this algorithm.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Engineering and technology journal

سال: 2023

ISSN: ['2456-3358']

DOI: https://doi.org/10.47191/etj/v8i5.11